Quasi-cyclic Expansion Algorithm for Protograph LDPC Codes Based on PEG and PH
نویسندگان
چکیده
One of the important code of modern coding theory, the protograph LDPC code technology has been gained more and more attention due to its low encoding complexity, fast decoding speed, low BER, and simple optimization analysis process etc. the quasi-cyclic expansion algorithm of the protograph LDPC codes, named as PQCE algorithms, can complete the extension of protograph and eventually get the protograph LDPC codes. However, the existing PQCE algorithms may be with a low convergence rate, or exist many short cycles in the check matrix. To solve the above problem, a Quasi-cyclic expansion algorithm for protograph LDPC codes based on PEG and PH is proposed in this paper, referred as PEG-PH-PQCE algorithm. In the proposed algorithm, base matrix is acquired by PEG parallel edges elimination expansion algorithm during the first-step expansion of protograph. Then, the second-step expansion is completed, in which the initial index matrix is obtained by PEG quasi-cyclic expansion algorithm, and the check matrix is acquired by using the Hill Climbing algorithm to optimizing the initial index matrix. Simulation results demonstrate the effectiveness the validity of the proposed algorithm, such as, a small number of short cycles and high convergence rate, etc.
منابع مشابه
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles
Random bipartite graphs, random lifts of bipartite protographs, and random cyclic lifts of bipartite protographs are used to represent random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes, respectively. In this paper, we study the distribution of cycles of different length in all these three categories of graphs....
متن کاملAn Unnoticed Strong Connection Between Algebraic-Based and Protograph-Based LDPC Codes, Part II: Nonbinary Case and Code Construction
This paper is the second part of a series of two papers on the investigation of the connection between two methods for constructing LDPC codes, namely the superposition and the protograph-based methods. In the first part, by taking the graph point of view, we established a strong connection between these two construction methods and showed that, in the binary case, the protograph-based construc...
متن کاملDesign of LDPC Codes: A Survey and New Results
This survey paper provides fundamentals in the design of LDPC codes. To provide a target for the code designer, we first summarize the EXIT chart technique for determining (near-)optimal degree distributions for LDPC code ensembles. We also demonstrate the simplicity of representing codes by protographs and how this naturally leads to quasi-cyclic LDPC codes. The EXIT chart technique is then ex...
متن کاملConstruction of Protographs for QC LDPC Codes With Girth Larger Than 12
A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices. In this paper, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2i, i = 6, 7, 8, 9, 10, i.e., the cycles existing regardless of the shift values of circulants. It is also derived that if the girth of the protograph...
متن کامل